Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

Q is empty.


QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

C(b(x1)) → B(c(c(x1)))
C(b(x1)) → A(b(c(c(x1))))
A(a(x1)) → A(b(x1))
C(b(x1)) → C(c(x1))
C(b(x1)) → C(x1)
A(a(x1)) → B(x1)

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(b(x1)) → B(c(c(x1)))
C(b(x1)) → A(b(c(c(x1))))
A(a(x1)) → A(b(x1))
C(b(x1)) → C(c(x1))
C(b(x1)) → C(x1)
A(a(x1)) → B(x1)

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
QDP
            ↳ UsableRulesProof
            ↳ UsableRulesProof
          ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(x1)) → A(b(x1))

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ MNOCProof
            ↳ UsableRulesProof
          ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(x1)) → A(b(x1))

The TRS R consists of the following rules:

b(x1) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [15] to enlarge Q to all left-hand sides of R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ UsableRulesProof
              ↳ QDP
                ↳ MNOCProof
QDP
                    ↳ UsableRulesReductionPairsProof
            ↳ UsableRulesProof
          ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(x1)) → A(b(x1))

The TRS R consists of the following rules:

b(x1) → x1

The set Q consists of the following terms:

b(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

The following dependency pairs can be deleted:

A(a(x1)) → A(b(x1))
The following rules are removed from R:

b(x1) → x1
Used ordering: POLO with Polynomial interpretation [25]:

POL(A(x1)) = 2·x1   
POL(a(x1)) = 2 + 2·x1   
POL(b(x1)) = 1 + x1   



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ UsableRulesProof
              ↳ QDP
                ↳ MNOCProof
                  ↳ QDP
                    ↳ UsableRulesReductionPairsProof
QDP
                        ↳ PisEmptyProof
            ↳ UsableRulesProof
          ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
P is empty.
R is empty.
The set Q consists of the following terms:

b(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ UsableRulesProof
            ↳ UsableRulesProof
QDP
                ↳ MNOCProof
          ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(x1)) → A(b(x1))

The TRS R consists of the following rules:

b(x1) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [15] to enlarge Q to all left-hand sides of R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ UsableRulesProof
            ↳ UsableRulesProof
              ↳ QDP
                ↳ MNOCProof
QDP
                    ↳ MNOCProof
          ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(x1)) → A(b(x1))

The TRS R consists of the following rules:

b(x1) → x1

The set Q consists of the following terms:

b(x0)

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ UsableRulesProof
            ↳ UsableRulesProof
              ↳ QDP
                ↳ MNOCProof
                  ↳ QDP
                    ↳ MNOCProof
QDP
          ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(x1)) → A(b(x1))

The TRS R consists of the following rules:

b(x1) → x1

Q is empty.
We have to consider all (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
QDP
            ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(b(x1)) → C(c(x1))
C(b(x1)) → C(x1)

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(b(x1)) → C(c(x1)) at position [0] we obtained the following new rules:

C(b(b(x0))) → C(a(b(c(c(x0)))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
QDP
                ↳ QDPToSRSProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(b(b(x0))) → C(a(b(c(c(x0)))))
C(b(x1)) → C(x1)

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].


↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
QTRS
                    ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))
C(b(b(x0))) → C(a(b(c(c(x0)))))
C(b(x1)) → C(x1)

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))
C(b(b(x0))) → C(a(b(c(c(x0)))))
C(b(x1)) → C(x1)

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
QTRS
                        ↳ DependencyPairsProof
                        ↳ QTRS Reverse
                        ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A(x)
B(b(C(x))) → B(a(C(x)))
B(b(C(x))) → A(C(x))
B(c(x)) → B(a(x))
A(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
                      ↳ QTRS
                        ↳ DependencyPairsProof
QDP
                            ↳ DependencyGraphProof
                        ↳ QTRS Reverse
                        ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A(x)
B(b(C(x))) → B(a(C(x)))
B(b(C(x))) → A(C(x))
B(c(x)) → B(a(x))
A(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
                      ↳ QTRS
                        ↳ DependencyPairsProof
                          ↳ QDP
                            ↳ DependencyGraphProof
QDP
                                ↳ Narrowing
                        ↳ QTRS Reverse
                        ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A(x)
B(b(C(x))) → B(a(C(x)))
B(c(x)) → B(a(x))
A(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(C(x))) → B(a(C(x))) at position [0] we obtained the following new rules:

B(b(C(y0))) → B(C(y0))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
                      ↳ QTRS
                        ↳ DependencyPairsProof
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ Narrowing
QDP
                                    ↳ DependencyGraphProof
                        ↳ QTRS Reverse
                        ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(b(C(y0))) → B(C(y0))
B(c(x)) → A(x)
B(c(x)) → B(a(x))
A(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
                      ↳ QTRS
                        ↳ DependencyPairsProof
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ Narrowing
                                  ↳ QDP
                                    ↳ DependencyGraphProof
QDP
                                        ↳ Narrowing
                        ↳ QTRS Reverse
                        ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A(x)
B(c(x)) → B(a(x))
A(a(x)) → B(a(x))

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(a(x)) → B(a(x)) at position [0] we obtained the following new rules:

A(a(a(x0))) → B(b(a(x0)))
A(a(x0)) → B(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
                      ↳ QTRS
                        ↳ DependencyPairsProof
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ Narrowing
                                  ↳ QDP
                                    ↳ DependencyGraphProof
                                      ↳ QDP
                                        ↳ Narrowing
QDP
                                            ↳ Narrowing
                        ↳ QTRS Reverse
                        ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A(x)
A(a(a(x0))) → B(b(a(x0)))
B(c(x)) → B(a(x))
A(a(x0)) → B(x0)

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(c(x)) → B(a(x)) at position [0] we obtained the following new rules:

B(c(a(x0))) → B(b(a(x0)))
B(c(x0)) → B(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
                      ↳ QTRS
                        ↳ DependencyPairsProof
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ Narrowing
                                  ↳ QDP
                                    ↳ DependencyGraphProof
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ Narrowing
QDP
                        ↳ QTRS Reverse
                        ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B(c(x)) → A(x)
A(a(a(x0))) → B(b(a(x0)))
B(c(x0)) → B(x0)
B(c(a(x0))) → B(b(a(x0)))
A(a(x0)) → B(x0)

The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → a(b(x))
b(x) → x
c(b(x)) → a(b(c(c(x))))
C(b(b(x))) → C(a(b(c(c(x)))))
C(b(x)) → C(x)

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
                      ↳ QTRS
                        ↳ DependencyPairsProof
                        ↳ QTRS Reverse
QTRS
                        ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(b(x))
b(x) → x
c(b(x)) → a(b(c(c(x))))
C(b(b(x))) → C(a(b(c(c(x)))))
C(b(x)) → C(x)

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))
b(b(C(x))) → c(c(b(a(C(x)))))
b(C(x)) → C(x)

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → a(b(x))
b(x) → x
c(b(x)) → a(b(c(c(x))))
C(b(b(x))) → C(a(b(c(c(x)))))
C(b(x)) → C(x)

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ Narrowing
              ↳ QDP
                ↳ QDPToSRSProof
                  ↳ QTRS
                    ↳ QTRS Reverse
                      ↳ QTRS
                        ↳ DependencyPairsProof
                        ↳ QTRS Reverse
                        ↳ QTRS Reverse
QTRS
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → a(b(x))
b(x) → x
c(b(x)) → a(b(c(c(x))))
C(b(b(x))) → C(a(b(c(c(x)))))
C(b(x)) → C(x)

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
QTRS
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → x1
a(a(x1)) → a(b(x1))
b(x1) → x1
c(b(x1)) → a(b(c(c(x1))))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse
QTRS

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → x
a(a(x)) → b(a(x))
b(x) → x
b(c(x)) → c(c(b(a(x))))

Q is empty.